A new generalization of Dekker's algorithm for mutual exclusion
نویسندگان
چکیده
منابع مشابه
When does a correct mutual exclusion algorithm guarantee mutual exclusion?
Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...
متن کاملDeriving a Scalable Algorithm for Mutual Exclusion
This paper details the design of a scalable algorithm for the mutual exclusion problem. Starting by inserting a redundant assignment into Peterson's algorithm for two processes, we derive another algorithm that uses only local spins, i.e., a process busy-waits only on locally accessible shared variables. The new two-process algorithm is then adapted to serve as a building block of the complete ...
متن کاملA New Token Passing Distributed Mutual Exclusion Algorithm
Eliminating interference between concurrently executing activities through mutual exclusion is one of the most fundamental problems in computer systems. The problem of mutual exclusion in a distributed system is especially interesting owing to the lack of global knowledge in the presence of variable communication delays. In this paper, a new token-based distributed mutual exclusion algorithm is...
متن کاملProof of Peterson’s algorithm for mutual exclusion∗
4 Checking the model 6 4.1 Validation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Mutual exclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Liveness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.4 Freedom from starvation . . . . . . . . . . . . . . . . . . . . . . . 8 4.5 Results . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملA Fair Distributed Mutual Exclusion Algorithm
ÐThis paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N ÿ 1 and 2 N ÿ 1 messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1986
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90089-x